Geographic coding for location search queries

ABSTRACT

A method for performing a location search includes receiving a location search query, determining key words corresponding to the location search query, identifying one or more documents that correspond to the key words in the location search query, and providing to a client system information identifying at least one location corresponding to the one or more documents.

RELATED APPLICATION

This application is a continuation of U.S. application Ser. No. 11/698,583, filed Jan. 25, 2007, which claims priority to U.S. Provisional Patent Application Ser. No. 60/763,168, filed Jan. 27, 2006, entitled “Geographic Coding for Location Search Queries,” which applications are herein incorporated by reference in their entirety.

TECHNICAL FIELD

Search engines provide a powerful tool for locating content in documents in a large database of documents, such as the documents on the Internet or World Wide Web (WWW), and/or the documents stored on the computers of an Intranet. The documents are located using an index of documents in response to a search query, consisting of one or more words, terms, keywords and/or phrases, henceforth called terms, that are submitted by a user. Documents in the index of documents may be matched to one or more terms in the search query to determine scores. A ranked listing of relevant documents or document locations, based on the scores, are provided to the user.

Search queries may have a variety of purposes and formats. One class of formats corresponds to location searches. Conventional location searches often use a fixed format, such as a template. Existing templates are often fixed or may only allow a limited number of variations. For example, words or terms in an existing location search query may have a pre-determined order (street name, state, zip code) and/or a pre-determined spelling. As a consequence, it is difficult or impossible (in conventional location searches) to accommodate a wide range of spellings, including spelling errors, alternative names for locations, and alternative address formats, such as those found in different countries.

Many existing search engines often return a single result in response to location search queries. In conjunction with the lack of format flexibility for the location search queries, this makes it difficult to accommodate an uncertainty or ambiguity in either the location search query and/or the results that are returned to a user.

The lack of flexibility in existing location search queries also often compromises search engine performance, since the existing location search queries are often processed in a single data structure. An inability to scale the data structure and distributed it throughout the search engine may lead to slower processing of location search queries. Overcoming such bottlenecks may result in additional search engine complexity and expense.

There is a need therefore, for improved formats and techniques for processing location search queries. In addition, there is also a need for improved reporting of results of location search queries to users.

SUMMARY

The above deficiencies and other problems associated with location search queries are reduced or eliminated by the disclosed embodiments of processes and search engines.

In some embodiments, a method for performing a location search includes receiving a location search query, determining key words corresponding to the location search query, identifying one or more documents that correspond to the key words in the location search query, and providing to a client system information identifying at least one location corresponding to the one or more documents.

Determining key words may include removing punctuation marks and non-location terms from the location search query. The key words may include one or more synonyms for one or more terms in the location search query. The key words may include pre-determined abbreviations corresponding to the one or more terms.

Identifying one or more documents may include determining a canonical expression corresponding to the key words. Identifying the one or more documents may include determining a score for each of the one or more documents. A respective score may be in accordance with a frequency of the key words in a plurality of documents, matches between one or more words in a respective document with one or more of the key words and sizes of geographic features corresponding to the key words. The identifying of the one or more documents may be independent of an order of the key words.

The one or more documents may be stored in an index that includes a plurality of documents that correspond to geographic features. The plurality of documents may include reference coordinates corresponding to the geographic features.

Providing information identifying at least one location corresponding to the one or more documents may include providing information identifying one location if a best score for a corresponding document is greater than a pre-determined multiple of a next best score for a next document in a top-N ranking of the one or more documents. The providing operation may include identifying up N highest ranked locations corresponding to the one or more documents, wherein the highest ranked documents having scores within a pre-determined range. In some embodiments, each of the locations in the top-N ranking includes a location identifier. In some embodiments, each of the locations in the top-N ranking includes a corresponding link to a map image.

The providing operation may include providing a map image corresponding to at least the one location. The map image may be centered on at least one location and may include a region less than a pre-determined size around the at least one location. In some embodiments, the at least one location may include two or more distinct locations whose corresponding documents have all the key words in common. The map image may include tags corresponding to the two or more locations.

In another embodiment, a data structure stored in a memory may be used for performing location search queries. The data structure may include a plurality of documents or records (hereinafter referred to as documents) that correspond to geographic features. A respective document in the plurality of documents may include location information and supplemental information. The location information may include key words or tokens corresponding to one or more locations, one or more regions associated with the one or more locations, and synonyms for the key words. The supplemental information may include reference coordinates corresponding to the one or more locations.

The reference coordinates may include latitude and longitude for the one or more locations. The reference coordinates may include regions surrounding the one or more locations. The regions may be less than a pre-determined size.

The data structure may be compatible with a hypertext markup language (HTML).

The location information in the respective document may be insensitive to an order of terms in a location search query.

In another embodiment, a graphical user interface includes a map image of a region that is provided in response to a location search query. The map image includes two or more tags corresponding to two or more distinct locations in the region that have all terms associated with the location search query in common.

In another embodiment, a graphical user interface includes a map image of a region that is provided in response to a location search query. The map image is centered on a location. The map image is provided independent of an order of terms associated with the location search query.

The aforementioned methods, data structures and graphical user interfaces may be included in and/or performed by a search engine system having one or more central processing units, a memory in one or more computers, and one or more programs stored in the memory and executed by the one or more central processing units.

BRIEF DESCRIPTION OF THE DRAWINGS

For a better understanding of the aforementioned embodiments of the invention as well as additional embodiments thereof, reference should be made to the Description of Embodiments below, in conjunction with the following drawings in which like reference numerals refer to corresponding parts throughout the figures.

FIG. 1 is a flow diagram illustrating an embodiment of a location search process.

FIG. 2 is a block diagram illustrating an embodiment of processing a location search query.

FIG. 3 is a block diagram illustrating an embodiment of distributing geographic feature documents over a plurality of indexes.

FIG. 4 is a block diagram illustrating an embodiment of a geographic feature document.

FIG. 5A is a block diagram illustrating an embodiment of a map image.

FIG. 5B is a block diagram illustrating an embodiment of a map image.

FIG. 6 is a block diagram illustrating an embodiment of results that are returned in response to a location search query.

FIG. 7 is a block diagram illustrating an embodiment of a search engine system.

FIG. 8 is a block diagram illustrating an embodiment of a search engine.

FIG. 9 is a block diagram illustrating an embodiment of a client system.

FIG. 10 is a block diagram illustrating an embodiment of a geographic features document data structure.

FIG. 11 depicts a set of geographic regions with respect to a current display window.

FIGS. 12 and 13 show how distances and regions on the surface of the Earth are measured as normalized angular distances, and also show how the location of a geographic feature in a viewport skirt region is converted into a ratio value.

FIG. 14 depicts a graph of a function for determining the radius of a skirt region in accordance with the radius of a viewport region.

FIG. 15 depicts a graph of a function used to assign a score attenuation factor in accordance with the location of a geographic feature relative to a current viewport region and skirt region.

DESCRIPTION OF EMBODIMENTS

Reference will now be made in detail to embodiments, examples of which are illustrated in the accompanying drawings. In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components, and circuits have not been described in detail so as not to unnecessarily obscure aspects of the embodiments.

Embodiments of systems and methods for performing location search queries and providing corresponding results to users are described. This processing is sometimes referred to as geocoding. Location search queries, such as a street address in a city, may be received from a user using a search engine coupled to a network, such as the Internet (also referred to as the World Wide Web or WWW) and/or one or more intranets. The location search queries are processed to determine a canonical or Boolean expression. The processing may include determining one or more key words in a respective location search query, removing punctuation marks and non-location terms (such as articles) from the respective location search query, and determining one or more synonyms for one or more terms in the respective location search query. The synonyms may include predetermined abbreviations for and/or predetermined misspellings of one or more terms in the respective location search query. The canonical expression may be independent of, i.e., insensitive to, an order of the key words.

The canonical expression may be compared to an index of geographic feature documents in a search engine. Each geographical feature document has a set of tokens that correspond to a geographical feature, which may be a location (e.g., a street, city, country, state, country) or a geographical entity (e.g., lake, river, mountain, continent, ocean, etc.). While a single geographical feature may correspond to a set of locations, such as a set of street addresses, all the locations associated with a geographical feature may be considered to be “a location” in the context of identifying the locations or geographical features that best match a location search query. The terms “geographical feature” and “location” are used synonymously in at least some portions of this document.

The index of geographical feature documents may be distributed over multiple computers in the search engine. The index may include location information and supplemental information. The location information may include key words, synonyms for the key words, and proximate objects for multiple locations. The supplemental information may include reference coordinates, such as latitude and longitude and/or a range or street numbers, for the locations.

Scores for a subset of the geographic feature documents that are a close match to a respective canonical expression may be returned by the computers. A ranking of a top-N geographic feature document may be determined. If a best score is more than a pre-determined multiple of a next best score, the location corresponding to the best score may be provided to the user along with a map image of the corresponding location. The map image may be centered on the corresponding location and may be sized to include a pre-determined bounding box, region or window around the corresponding location. Alternatively, if the best score is less than the pre-determined multiple, several locations corresponding to a range of scores may be provided to the user. Additional information, such as a location identifier (city, state, zip code and/or country) and/or links to corresponding map images, may be provided.

The embodiments, therefore, may accommodate a wide variety of formats, allow for ambiguity in the location search query and/or in the results, and may be use parallel processing so as to provide high speed processing of location search queries (sometimes called location searching). The embodiments, therefore, may provide improved processing of location search queries.

Attention is now directed towards location search processes. FIG. 1 is a flow diagram illustrating an embodiment of a location search process 100. While the location search process 100 described below includes a number of operations that appear to occur in a specific order, it should be apparent that the process 100 can include more or fewer operations, which can be executed serially or in parallel (e.g., using parallel processors or a multi-threading environment), an order of two or more operations may be changed and/or two or more operations may be combined into a single operation.

A location search query may be received (110). Key words may be determined (112). The location search query may be converted into a canonical form (114). This may include removing one or more non-location or noise words or terms, punctuation marks, diacritical marks (i.e., a mark added to letter to indicate a special pronunciation), and/or street numbers from the location search query. A Boolean expression may be generated (116). The Boolean Expression may contain synonyms for one or more words or terms in the location search query. Converting the search query into canonical form may also include expanding one or more abbreviations, such as expanding “st.” or “st” into “street”. In some embodiments, a misspelled word or term in the location search query (e.g., a term the query processing process determines is likely to be misspelled) may be “corrected” by supplementing the query with a “synonym” for the misspelled word that comprises the corresponding correctly spelled word. Determining the key words (112) may make a resulting query independent of the order of the key words. N (e.g., ten) best matching geographical feature documents may be identified from a geographic features document database (118). At least one geographical feature or location corresponding to the identified documents may be provided (120). Alternately, in some situations zero documents are provided to the requesting user. For example, in some embodiments, if all of the N best matching geographical feature documents have a score (scores are described below) that is less than a first threshold value, no geographical features or locations are identified. In another example, the list of N best matching geographical feature documents is filtered to remove (A) documents whose score is less than a first threshold, and (B) documents whose SAF (described below) is less than a second threshold and whose score is less than a third threshold (e.g., the third threshold would typically be higher (i.e., more restrictive) than the second threshold). The latter “filter” removes poor quality matches that exceed the first threshold, but which are far outside the current viewport (as defined below), thereby allowing another geographical feature or location within or closer to the current viewport to be identified as the best match.

Identifying the N best matching documents 118 requires several computational operations. First, geographical feature documents satisfying the search query are identified 118A. For example, this may be accomplished by retrieving lists of documents having tokens that match each of the query terms and then performing a Boolean AND operation on the retrieved lists to produce a list of documents (if any) having tokens that match all the query terms. In this context, each token is a word, symbol or combination of words and/or symbols associated with a geographical feature. To compensate for human error, a document's tokens may include a variety of misspellings of various terms that describe the geographical feature associated with the document, and may include the names (and misspellings thereof) of neighboring or nearby geographical features (e.g., in case a user's search query incorrectly specifies a neighboring city or the like, but otherwise accurately lists terms associated with the geographical feature). In another example, the search query is first “rewritten,” by removing any non-location terms and any punctuation, prior to identifying documents that satisfy the search query. Optionally, a respective individual term in the search query can be replaced by a Boolean OR expression that includes the term and one or more synonyms. In some embodiments, synonyms are added to the search query for each term in the query for which a set of synonyms has been predefined. The “synonyms” added to a search query as part of a Boolean OR expression may also include “generic synonyms” for individual components of compound terms. For example, a generic synonym of the first component of the street name “N Rengstorff” is “directional_keyword,” which matches any directional keyword, including N, S, E, W, North, South, East, and West. Another example of a generic synonym is “affix_keyword” which matches words (or tokens) such as ave., avenue, blvd., boulevard, ln, lane, rd, road, st, street, rue and so on. Similar generic synonyms are also included as tokens in the document database, at the same address component positions as the corresponding “correct” keywords. Matches between generic synonyms in a rewritten search query and a document produce a significantly lower score than a match between a non-synonym keyword in the search query and a non-synonym token in a document. Optionally, other modifications can be made to the search query in accordance with predefined rules so as to improve the quality of the search results.

Next, scores are computed for the identified matching documents 118B. Exemplary processes for generating the score for each matching document are discussed in some detail below. Generally, though, documents with high quality matches to the search query are assigned higher scores than documents with lower quality matches to the search query. Other factors, such as the locations of the geographical features corresponding to the matching documents, relative to a current viewport in which a map or image is displayed, and the relative importance of these geographical features, may also be factors in computing the scores. The matching documents are then ranked based on the computed scores 118C, and the N highest ranked documents are identified 118D. In some embodiments, the ranking of the documents and the selection of the N highest ranked documents is combined into a single operation (e.g., by running a top N filter over the scores). In some embodiments, documents having lower rank than the top N documents are not ranked.

FIG. 2 is a block diagram illustrating an embodiment 200 of processing a location search query. A location search query 210, such as “155 Abe Ave. Great Neck N.Y.”, is used as an illustrative example. The street number 155 and the period may be removed during operation 114 resulting in Abe Ave Great Neck N.Y. In operation 116, the location search query may be converted into a Boolean expression, including expanding abbreviations (such as Ave) and synonyms. The resulting Boolean expression is Abe AND (Ave OR Avenue OR Street OR Lane OR Court OR . . . ) AND (Great Neck) AND (NY OR (NEW YORK)). This Boolean expression is independent of, i.e., insensitive to, an original word or term order in the location search query 210. As such, it may accommodate a wide variety of formats for the location search query 210. Such a Boolean expression has a form that may be processed in a search engine using a distributed geographic feature document database. This is discussed further below.

Attention is now directed towards embodiments of the geographic feature document database. FIG. 3 is a block diagram illustrating an embodiment 300 of distributing geographic feature documents over a plurality of indexes, which may be stored on multiple computers in a search engine. Geographic features documents 310 may include a plurality of geographic feature documents 312. A respective geographic feature document, such as document 312-1, may include a feature type (such as a street, road, route, city, country, intersection, etc.), a feature name (i.e., the name of a location), primary terms or tokens (such as specific key words associated with the feature), nearby feature terms or tokens (such as adjacent or proximate landmarks or locations of interest) and supplemental information (such as latitude and longitude of the feature). The supplemental information may be used by a map or tile server to present a map image(s) corresponding to the location in the respective geographic feature document. This is described further below with reference to FIGS. 5 and 7.

A partitioner 314 may distribute subsets of the geographic feature documents 310 via one or more indexers 316 to a respective index, such as index 320-1, in a plurality of indexes 320. The index 320-1 may correspond to one partition or sub-partition of the indexes 320 (which may collectively be considered to be the inverse index of the entire geographic feature documents database). The indexes 320 may be stored on one or more computers in the search engine. The subsets may be distributed such each index 320 handles an equivalent or approximately equivalent portion of processing associated with the respective location search query. For example, the documents 312-1 may be distributed randomly or pseudo-randomly over the indexes 320. For instance, a hash function and modulo function may be used to distribute the geographic feature documents to M indexers, were M is the number of indexes (sometimes called index partitions or index sub-partitions). In this example, a hash function is applied to each geographic feature document (or to a predefined portion of the document) to produce a hash value, and then a “modulo M” function is applied to the hash value to produce a selection value between 0 and M−1. The selection value determines which of the M indexers 316 is to receive the document for indexing.

When processing the respective search query, each of the indexes 320 may provide a top-N (such as a top-10) set of documents in the subset of documents that match the respective query. As discussed further below, the top-N documents may be based on a ranking of scores. In particular, a score may be determined for each document that matches the search query. The score may be based on the canonical and/or Boolean expression for the respective location search query. Referring to FIG. 7, the query processing for each sub-partition of the index 320 is handled by a respective server 730, which returns information identifying up to N of the highest ranking documents that match the query. A server 726 that may be called an aggregator or partition level query execution manager combines the search results from the servers 730, for example by selecting the N best search results from among the results returned by the servers 730. At a next higher level in the hierarchy, query execution manager 720, the search results from all the aggregators 726 are combined, by selecting the N best search results from among the results returned by the aggregators 720. More generally, a predefined number of best search results are selected at each level in a distributed hierarchy and are passed on to the next level. For example, if 10 sets of top-10 documents are received at a given level, the top-10 documents may be determined and passed on. In this way, the top-N documents in the documents 312 may be determined and/or identified using a distributed implementation. This approach may improve performance of the search engine and may reduce system cost and/or complexity.

FIG. 4 is a block diagram illustrating an embodiment of a geographic feature document 400, such as the document 312-1. The document 400 may be compatible with hypertext markup language (HTML) and/or extensible markup language (XML). The document 400 may include information corresponding to a geographic feature, such as a location (e.g., a street, intersection, city, point of interest, etc.). Some documents 400 may include information for more than one location (e.g., multiple segments of a street, city, or the like). Such location information may include key words corresponding to the one or more locations, one or more regions associated with the one or more locations and synonyms for one or more of the key words.

As shown in the embodiment 400, text following an HTML tag <CN> may indicate a type of location, in this case a route. Text following an HTML tag <CNA> may indicate an explicit name for the location, in this case Victoria Street. Text following HTML tags <CA> may indicate key words corresponding to the location, such as Westminster, London and England. Text following HTML tags <A> may indicate synonyms for the key words and/or the explicit name for the location, such as Angleterre, United Kingdom and Verenigd Koninkrijk. The synonyms may include words from foreign languages (i.e., languages other than the language of the key words). In some embodiments, the synonyms may include abbreviations and/or common misspellings in one or more keywords and/or in the explicit name for the location. Text following HTML tags <Cn> may indicate other locations or regions that are nearby or that neighbor the location. In this example, the nearby locations or regions are Islington, West End and Covent Garden.

The tagged text or information items in a document 400 may be called information items or text items or tokens. The information items or text items are processed by the indexers 316 (FIG. 3) to produce the indexes 320.

The document 400 may include less information or additional information, including fewer or additional tags. For example, the document 400 may include supplemental information, such as reference coordinates corresponding to the geographic features, that may be used by a map or tile server. In an exemplary embodiment, the reference coordinates may include latitudes and longitudes for one or more locations and/or a range of street numbers that bracket one or more locations. In other embodiments, an order of the information in the document 400 may be changed. Two or more items in the document 400 may be combined into a single item.

One specific example of supplemental information in a document 400 is the supplemental information for street or other route. In this example, the supplemental information includes one or more segments, each corresponding to a portion of the street or route. Each segments specifies a beginning and ending street number corresponding to first and second ends of the segment, and also specifies a latitude and longitude for each end of the segment. When a location search query that includes a street number matches the document 400, the specified street number is used to identify the best matching segment in the document's supplemental information. If the specified street number falls between the beginning and ending street numbers for the best matching segment, linear interpolation is used to determine a latitude and longitude for the location specified by the location search query. Alternately, if the specified street number matches the beginning or ending street number for the best matching segment, then the corresponding latitude and longitude are used for the location of the location specified by the location search query.

As mentioned previously, when comparing a canonical and/or Boolean expression corresponding to the respective location search query to documents 312 (FIG. 3) in the geographic feature documents 310 (FIG. 3) scores indicative of a degree of matching may be determined. These scores may indicate a relevancy of the documents 212, and thus, the corresponding locations, to the location search query. As such, the scores may be used by the search engine to determine a best result, i.e., a best location, or a list of the top-N results, i.e., the top-N locations, in response to the location search query.

In some embodiments, scores may only be determined for a subset of the documents 312 (FIG. 3), i.e., the search engine may determine a candidate set of documents that may correspond to the location search query. In an exemplary embodiment, criteria for inclusion in the candidate set of documents may include a requirement that at least one of the key words match the explicit name of the feature (the text following the <CNA> tag in FIG. 4) and that each of the elements or terms in the canonical and/or Boolean expression occurs in a document.

In an exemplary embodiment, the scores may be determined using

${{\frac{1}{E}\left\lbrack {\sum\limits_{i}{IR}_{i}} \right\rbrack} \times {FR} \times Q},$ where IR_(i) is a query match score (with respect to a particular candidate document) corresponding to a respective term or element “i” in the canonical and/or Boolean expression, FR is “feature rank” that indicates an importance of the feature or location, E is a normalization value, and Q is an optional factor. Q may correspond to the quality of the match between the query and the candidate document, or it may correspond to any other metric that may be used to improve the quality of the search results. An example of the Q factor is the SAF factor described below with reference to FIGS. 11-15. In another example, Q is set equal to SAF*Product(P_(j)), where SAF is the score attenuation factor described below, each P_(j) is a penalty factor, and Product(P_(j)) is the product (i.e., the multiplicative product) of all the penalty factors. Each of the penalty factors has a default value of 1.0, and is assigned a lower value (e.g., 0.7 or the like) if the corresponding penalty is applicable to the document in question. Examples of penalty factors are: A) a penalty factor that is applied when the document is neither in the user's country nor in his current viewport (as defined below); B) a penalty factor that is applied when the match between the document and the query is an inexact match (e.g., because the query contains an extraneous or mistaken term or symbol, and the only match between the mistaken term or symbol and the document is a match with a “generic synonym” token (see explanation above concerning “generic synonyms”)); and C) a penalty factor that is applied when the match between the query and the document is missing a key element (e.g., when the query matches a street name token and a country token, but not a city token of the document). Other penalty factors may be used in other embodiments. Generally, penalty factors are associated with situations indicative of a potentially poor quality match between a geographical feature document and a search query. In other embodiments, Q is not used, or equivalently is set equal to 1.

In some embodiments, the normalization value, E, is the maximum value of the sum of the IR_(i) scores for a perfect match, or equivalently the sum of the token masses for the key words in the search query. The sum of the IR_(i) values may be called the total match score or IR score for the candidate document. The value of IR_(i) for a particular key word in the search query may include a product of weights. The weights may include a token mass, a relevance score and an element mass for the corresponding element or term in the canonical and/or Boolean expression. The token mass may correspond to a type of term, where the types of terms may include stop words, street affix key words (e.g., a street prefix word such as “rue” in French, or street suffix words such as “street,” “avenue,” “road,” and “place” in English), numbers, synonyms, and other key words, with each predefined type of term being assigned a predefined token mass. The predefined token mass values may have a predefined range, such as 0 to 1, or 0 to 8, or the like. In some embodiments, the default token mass (for “other key words”) is 1, while token types such as synonyms, and street affix key words and stop words are all assigned lower token mass values. In some embodiments synonyms are assigned a larger token mass than street affix words.

The relevance score may vary based on the degree of text match, with a predefined largest value for a complete text match between a query key word and an information element of the document. When the best match of a query key word with the information elements of a document is only a partial match (e.g., the query key word matches only one word of a multiword element), the relevance score is less than the predefined largest value, and reflects the degree of text match.

The element mass may vary as a function of a size or type of the geographic feature associated with an information item (in the candidate document) that matches a query key word. For example, an information item that is country name may be given a higher element mass than an information item that is a locality name (such as a city name), which in turn is given a higher value than an information that is a street name. The element mass may also reflect the type of information item that matches the query key word. For example, the information item that contains the explicit name for the geographical feature may be assigned a highest element mass, an information item that is a “context” item (e.g., the city or country in which a street is located) may be assigned a next highest element mass, and an information item that contains the name of a nearby city, region or other geographical feature may be assigned a lowest element mass. In some embodiments, the element mass for an information item in a candidate document is equal to the product of two element mass factors, one of which is based on the size or type of the geographical feature named by the information item and the second of which is based on the type of information item (explicit name, context, or nearby feature) that matches the query key word. In some other embodiments, the element mass for an information item in a candidate document is equal to the sum of these two element mass factors.

The feature rank, FR, for a candidate document may be based on a document frequency (a number of times a feature is referenced in the documents 312 in the database 310, FIG. 3), or it may be based on the size of a geographic feature, with bigger features (i.e., geographic extent) given higher feature rank values. In other embodiments, the feature rank can be based, at least in part, on the importance or popularity of the geographic feature corresponding to the candidate document. For example, the importance or popularity of the geographic feature corresponding to a candidate document may be determined by a world-wide-web search or other database search on the name of the geographic feature.

When a query key word has one or more synonyms, an IR score is computed (with respect to a candidate document) for each of the synonyms and for the query key word, and then the best of those IR scores is selected and used when computing the combined IR score for the candidate document.

In some embodiments, the scoring function shown above is modified so as to increase the importance of one or more factors relative to the other factors. For example, the scoring function may be changed to

${\left( {\frac{1}{E}\left\lbrack {\sum\limits_{i}{IR}_{i}} \right\rbrack} \right)^{M} \times {FR} \times Q},$ where the exponent, M, is a value greater than one (e.g., 2, 2.5 or 3), and is typically between two and five (2≦M≦5), so as give the normalized total match score more importance in the scoring function than the feature rank, FR, and Q factors. In some embodiments, the scoring function discussed above is modified to favor documents whose name has terms in the same order as the terms are positioned in the search query over documents matching the same terms, but which have the terms in a different order in their name. For example, the total match score may be supplemented (e.g., total match score+pair-wise match score) with a pair-wise matching score (e.g., total match score+pair-wise match score), which is based on the number of ordered term pairs (ordered, neighboring terms) in the search query that match ordered terms pairs in the document name.

Attention is now directed towards embodiments of a process for providing one or more location results to the user in response to the location search query. If a best score for a first document is greater than a pre-determined multiple of a next best score for a second document in a top-N ranking (for example, the next best score is less than 70% of the best score), the location corresponding to the first document may be provided to the user. Using the supplemental information stored with the document, a map or tile server may provide a map image of a region centered on the location to the user. For example, if the supplemental information includes street addresses bracketing the location, the center of the map image may be determined using linear interpolation. FIG. 5A is a block diagram illustrating an embodiment of a map image 500 provided to the user. A location tag 512-1 corresponding to the location is centered in a bounding box 510. The bounding box 510 is sized such that a region 514 surrounding the location may be provided. The size of the bounding box 510 may be determined based on the size of the geographic feature or location. Different sized features (such as cities or countries) may have different sized bounding boxes.

In some cases, more than one distinct location (i.e., spatially separated from one another) in a region may have the same or almost the same score. For example, more than one location may match all of the key words in the canonical and/or Boolean expression corresponding to the location search query. In such cases, these results may be provided to the user. This is illustrated in FIG. 5B, which is a block diagram illustrating an embodiment of a map image 550. A bounding box 510 is defined which includes all the locations that meet predefined selection criteria. Location tags 512 corresponding to the distinct locations are included in the bounding box 510. In some embodiments, the tags are links. By clicking on one of the tags, the user may select the corresponding location. This location may be presented to the user along with a map image, such as the map image 500 (FIG. 5A). In some other embodiments, a list 520 of the best matching locations is listed next to the map 550. Each item in the list may include a link to a map corresponding to that location. Each item in the list 520 may be represented by the canonical name (identified by a CNA tag in the example in FIG. 4) and the context text (identified by the CA tags in the example in FIG. 4) from the corresponding geographical feature document.

If the best score is not greater than the pre-determined multiple of the next best score, locations corresponding to a range in the top-N ranking may be provided. For example, locations (from among the top N results) having scores greater than or equal to 50% of the best score may be provided. A variety of information may be provided along with the locations. An exemplary graphical user interface for showing multiple search results returned in response to a location search query is shown in FIG. 6. In one region 610 or column, the best matching geographic features or locations are listed, and in another region of the graphical user interface are shown individual small maps 620, one for each of the best matching geographic features or locations listed in region 610. In this example, the location search query was “San Antonio,” which produced several possible relevant answers. The answers may be provided with one or more location identifiers, such as a city, a state, a zip code, and/or a country. In some embodiments, the small maps 620 each include a link to a corresponding, larger map. Similarly, in some embodiments, each of the listed best matching locations in region 610 include a link to a corresponding larger map. Clicking on one of the answers or small maps may allow the location to presented to the user along with a map image, such as the map image 500 (FIG. 5A).

Attention is now directed towards embodiments of search engines, client computers and data structures for implementing the previously described method, geographic feature documents and graphic user interfaces. FIG. 7 is a block diagram illustrating an embodiment of a search engine system 700 that generates location search query results in response to location search queries received from one or more clients 710 (also herein called client devices or client systems), such as client system or device 900 (FIG. 9). Each client 710 may have a search assistant, such as search assistant module 930 (FIG. 9). It should be appreciated that the layout of the search engine system 700 as shown in FIG. 7 is merely exemplary and may take on any other suitable layouts or configurations. The search engine system 700, therefore, may include fewer or additional components or modules, may be implemented in hardware and/or in software, and a location or one or more components or modules may be changed. The search engine system 700 is used to search an index of documents, such as the geographic feature documents 310 (FIG. 3).

The search engine system 700 may include a mapping application server 714 that communicates with the clients 710 using a communication network 712. The communication network 712 may be the Internet and/or an intranet. The mapping application server 714 may forward location search queries to query server 716 and receive location results from the query server 716. The mapping application server 714 may use the supplemental information in the locations results to access appropriate map images from tile server 718 and to provide such map images along with the location results to the clients 710.

The query server 716 may determine the key words in the location search query, including converting the location search query to canonical form and/or generating a Boolean expression. The canonical and/or Boolean expression may be forwarded to query execution manager 720 for processing. The query execution manager 720 may provide the canonical and/or Boolean expression to multiple partitions 724 in geographic features documents database 722. In each partition 724, such as partition 724-K, a partition level query execution manager 726 may distribute the canonical and/or Boolean expression to servers 730 for one partition. The servers 730 may store the indexes 320 (FIG. 3). As discussed previously, the servers in the geographic features documents database 722 may determine the top-N documents corresponding to the location search query in a hierarchical fashion.

Upon receiving the top-N documents, the query execution manager 720 may access corresponding geographic or location information, such as the supplemental information, in document servers 734. In some embodiments, the geographic or location information may be included in the geographic features documents database 722.

Elements in the search engine system 700, such as the query server 716, may be dispersed over a group of servers so as to provide very fast processing of location search queries. In some embodiments, the system 700 may include replicas of the query server, query execution manager, tile server and geographic features documents database at multiple locations, in a plurality of datacenters (e.g., located on different continents, and/or at different locations within one or more countries). Location search queries submitted by users at one of the clients 710 to the search engine system 700 are routed to an appropriate datacenter using the Domain Name System (DNS), based on current load, geographic locality and/or the operational status of each of the datacenters.

Each backend preferably includes multiple query servers, such as query server 716, coupled to a communications network 712. The communications network 712 may be the Internet, but may also be any local area network (LAN) and/or wide area network (WAN). In some embodiments, each query server 716 is a server that receives location search query requests and delivers search location results in the form of web pages via HTTP, XML or similar protocols. Alternatively, if the query server 716 is used within a LAN, i.e., internally and not by the public, it may be an Intranet server. The query servers, such as query server 716, are configured to control the search process, including searching a document index, analyzing and formatting the search results. In some embodiments, a backend includes multiple query execution managers 720, coupled to the multiple query servers, such as the query server 716.

FIG. 8 is a block diagram illustrating an embodiment of a search engine 800. The search engine 800 may include at least one data processor or central processing unit (CPU) 810, a communications or network interface 820 for communicating with other computers, servers and/or clients, memory 822 and one or more signal lines 812 for coupling these components to one another. The one or more signal lines 812 may constitute one or more communications buses.

Memory 822 may include high-speed random access memory and/or non-volatile memory, such as one or more magnetic disk storage devices. Memory 822, or alternatively one or more storages devices (e.g., one or more nonvolatile storage devices) within memory 822, includes a computer readable storage medium. Memory 822, or the computer readable storage medium of memory 822, may store an operating system (or a set of instructions) 824, such as LINUX, UNIX or WINDOWS, that includes procedures for handling basic system services and for performing hardware dependent tasks. Memory 822, or the computer readable medium of memory 822, may also store communication procedures (or a set of instructions) in a network communication module 826. The communication procedures are used for communicating with clients, such as the clients 710 (FIG. 7), and with other servers and computers in the search engine system 700 (FIG. 7).

Memory 822, or the computer readable medium of memory 822, may also store a query server module (or a set of instructions) corresponding to the query server 716 (FIG. 7), geographic feature document database 722, documents 832 and selected results 836. The query server module 716 may include a key word processor 828, which may rewrite received search queries, as described above. The geographic feature document database 722 may include multiple indexes 830. The documents 832 may include multiple documents 834 that include geographic or location information. The selected results 836 may include results 838 to one or more location search queries.

Although FIG. 8 (like FIG. 7) shows search engine 800 as a number of discrete items, FIG. 8 is intended more as a functional description of the various features which may be present in a search engine system rather than as a structural schematic of the embodiments described herein. In practice, and as recognized by those of ordinary skill in the art, the functions of the search engine 800 may be distributed over a large number of servers or computers, with various groups of the servers performing particular subsets of those functions. Items shown separately in FIG. 8 could be combined and some items could be separated. For example, some items shown separately in FIG. 8 could be implemented on single servers and single items could be implemented by one or more servers. The actual number of servers in a search engine system and how features are allocated among them will vary from one implementation to another, and may depend in part on the amount of information stored by the system and/or the amount data traffic that the system must handle during peak usage periods as well as during average usage periods.

FIG. 9 is a block diagram illustrating an embodiment of a client computer, device or system 900. Client system 900 may be a desktop computer, laptop computer, personal digital assistant (PDA), cell phone, personal navigation device, or the like. Client system 900 generally includes one or more processing units (CPU's) 910, a user interface 914, one or more network or other communications interfaces 912, memory 922, and one or more communication buses 920 for coupling these components. The user interface 914 may include one or more keyboards 918, one or more displays 916, and/or one or more pointers (not shown), such as a mouse. Memory 922 may include random access memory, such as DRAM, SRAM, DDR RAM or other random access solid state memory devices; and may include non-volatile memory, such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices. The communication buses 920 may include circuitry (sometimes called a chipset) that interconnects and controls communications between system components. Memory 922 may include mass storage that is remotely located from the central processing unit(s) 910.

In some embodiments, memory 922 may include an operating system (or a set of instructions) 924, a network communications module (or a set of instructions) 926, a browser/tool module 928 and/or a search assistant module (or a set of instructions) 930. The search assistant module 930 may include an entry and selection monitoring module (or a set of instructions) 932, a transmission module (or a set of instructions) 934, a search results receipt module (or a set of instructions) 936 and/or a display module (or a set of instructions) 936.

The operating system 924, such as LINUX, UNIX or WINDOWS, may include procedures (or sets of instructions) for handling various basic system services and for performing hardware dependent tasks. The network communication module 926 may be used to connect client system 900 to other computers (e.g., other client computers and/or a search engine) via the one or more communication network interfaces 912 and one or more communication networks, such as the Internet, other wide area networks, local area networks, metropolitan area networks, and so on.

The browser/tool module 928 may be a web browser that a user of the client system 900 may use to communicate and/or exchange information with one or more hosts (such as one or more websites and/or web pages) on the one or more communication networks. For example, the user may surf the Internet (e.g., display a web page and/or a web site) using the browser/tool module 928.

The search assistant module 930 (e.g., a browser extension, a browser toolbar, or instructions embedded in a search engine web page) may be used by the user to perform one or more search queries, such as location search queries, using a search engine and to receive corresponding search results, including one or more locations, one or more map images, one or more URLs and/or hyperlinks. In particular, the entry and selection monitoring module 932 may monitor user input, the transmission module 934 may send a search query to the search engine, the search results receipt module 936 may receive the search results from the search engine, and the display module 938 may display the search results (or may assist in rendering the search results for display by the browser module 928), such as a ranking of the one or more documents and/or document locations that contain identified content corresponding to the search query. The user may access or select one or more of the documents and/or document locations in the search results using the user interface 914 and the browser/tool module 928. For example, the user may click on a hyperlink using the pointer (not shown).

In embodiments where the client system 900 is coupled to a local server computer, one or more of the modules and/or applications in memory 922 may be stored in the server computer, which is typically at a different location than the client system 900. Each of the above identified modules and applications corresponds to a set of instructions for performing one or more functions described above. These modules (i.e., sets of instructions) need not be implemented as separate software programs, procedures or modules. The various modules and sub-modules may be rearranged and/or combined. Memory 922 may include additional modules and/or sub-modules, or fewer modules and/or sub-modules. For example, the search assistant module 930 may be integrated into the browser/tool module 928. Memory 922 may, therefore, include a subset or a superset of the above identified modules and/or sub-modules.

FIG. 10 is a block diagram illustrating an embodiment of a geographic feature document data structure 1000. The geographic feature documents data structure 1000 may include geographic feature documents 722. The geographic feature documents 722 may include multiple records 1010 that are distributed over multiple partitions on multiple computers. Each record 1010 may correspond to a respective geographic feature document. As explained above, the geographic feature documents may correspond to geographic features or locations. The records may include key words 1012, synonyms 1014 for one or more key words, associated words 1016 (such as a city where the location occurs) and/or proximate objects 1018. The geographic feature documents data structure 1000 may include fewer or additional elements, two or more elements may be combined and positions of one or more elements may be changed. For example, a respective record 1010 may further include the supplemental information 1018, including latitude and longitude information for one or more locations or bounding boxes associated with the geographic feature represented by the record 1010.

Viewport-Relative Scoring of Results from Location Search Queries

When a user performs a series of location searches, for example using an online mapping program or service, the user is often searching for geographic features (e.g., cities, streets, specific addresses, or the like) that are nearby the geographic feature(s) found in the immediately prior location search. For example, after searching for a first geographic feature in a particular city, the user will often search for a second geographic feature that is either in the same city, or in a neighboring or nearby city. For ease of discussion, geographic features are sometimes called “locations,” but it should be understood that some geographic features, such as a street (as opposed to a specific street address), correspond to a large number of locations.

Referring to FIG. 11, in the following discussion, the “viewport” or “current viewport” corresponds to the geographic region currently displayed on the user's client device or system. For example, the viewport may be the display window produced (e.g., by an online mapping program or service) in response to the immediately preceding location search, or it may be a circular region that bounds the viewport rectangle displayed on the user's client system. Thus, the viewport can be rectangular or circular in shape. In the remainder of this discussion, the viewport is assumed to be circular in shape and to surround and include the viewport rectangle displayed on the user's client system. In addition, the viewport may result from user actions (e.g., pan and/or zoom commands or actions) that change the viewport to a user-specified region.

When a user submits a location query that results in more than one result, the results may be scored so as to favor results (i.e., locations) within the current viewport over locations outside the viewport, and to favor locations near the viewport (e.g., within a skirt region around the viewport, herein called the “viewport skirt region”) than locations further away from the viewport. In one embodiment, the scoring function described above for scoring “documents” (sometimes called location description documents or location description database entries) is modified to include a score attenuation factor (SAF), which biases the score to favor results that intersect the current viewport, and to favor results that intersect a viewport skirt region that surrounds the viewport over results that intersect neither the viewport region nor the viewport skirt region (i.e., which are outside the viewport skirt region). In this context, the term “intersect” means that at least a portion of the geographic feature identified by a search result falls within a particular region.

As shown in FIGS. 12 and 13, the sizes of regions and distances on the surface of the earth may be measured in terms of “angular distances”, which is the angular size of the arc on the earth's surface that is subtended by those regions or distances. Angular distances may be measured in units of radians or degrees. Normalized angular distances are divided by a normalization factor, such as 2π, so that the maximum angular distance is 1 (or any other predefined value) and the minimum angular distance is 0. In FIGS. 12 and 13, X1 represents the normalized size of the viewport region, based on the angular distance of the viewport region's radius R1. X2 is the normalized size of the viewport skirt region, based on the angular distance of the viewport skirt region's radius R2. X2-X1 represents the width of the viewport skirt region. X3 represents the normalized angular distance between a geographical feature and the closest edge of the viewport region, or more generally the distance between the geographical feature and the viewport region. X represents the ratio of (A) the distance between the geographical feature and the viewport region, and (B) the width of the viewport skirt region.

In one embodiment, the size of the viewport skirt region depends on the size of the viewport region. In particular, when the radius of the viewport region is small (e.g., less than a few kilometers), the radius of the viewport skirt region is as much as 1+SkirtFactor times as large as the radius of the viewport region, where SkirtFactor is a configurable parameter. When the radius of the viewport region is large (e.g., more than a few hundred kilometers), the radius of the viewport skirt region is approximately the same as the radius of the viewport region. In an exemplary embodiment, the radius of the viewport skirt region is defined as: SkirtRegionRadius=ViewportRadius×(1+SkirtFactor×EV) EV=A+B×e ^(−M×X1) where A and B are selected so that EV equals its maximum value, 1, when X1 is equal to zero (i.e., when the viewport region is very small), and EV equals its minimum value, 0, when X1 is equal to its maximum value, 1 (corresponding to a viewport region that covers the entire earth). SkirtFactor is a configurable scaling factor. An exemplary value of SkirtFactor is 10; in other embodiments, SkirtFactor is equal to a value between 4 and 20. M is a configurable exponential rate factor. An exemplary value of M is 50; in other embodiments, M is equal to a value between 10 and 200. In addition, the value of M depends on the scaling of the angular distance X1. Solving for A and B in accordance with the constraints stated above, the equation for EV becomes:

${EV} = {\frac{{\mathbb{e}}^{- M}}{1 - {\mathbb{e}}^{- M}} - {\frac{{\mathbb{e}}^{{- M} \times X\; 1}}{1 - {\mathbb{e}}^{- M}}.}}$ When M=50, e^(−M) is very close to zero (e⁻⁵⁰≈1.9*10⁻²²), and EV is approximately equal to e^(−M*X1).

In an exemplary embodiment, the scores may be determined in accordance with the following scoring function

${{Score} = {{\frac{1}{E}\left\lbrack {\sum\limits_{i}{IR}_{i}} \right\rbrack} \times {FR} \times {SAF}}},$ where IR_(i) is a query match score (with respect to a particular candidate document) corresponding to a respective term or element “i” in the canonical and/or Boolean expression, FR is the “feature rank,” which indicates the importance of the feature or location, E is a normalization value, and SAF is the scoring attenuation factor mentioned above. The IR, FR and E parameters are discussed in more detail above, and that discussion is equally applicable to the scoring function discussed here. It is noted that the sum of the IR_(i) values for a particular candidate document (or geographical feature) can be considered to be an information retrieval score or query match score for the candidate, and that all the other parameters of the scoring function are for scaling, boosting or attenuating the score in accordance with additional factors so as to improve how the search results are ranked (i.e., so that the topmost ranked search results are the search results that are most likely to correspond to the geographical feature that is being sought by the user).

In an exemplary embodiment, the SAF for a particular geographic feature is determined in accordance with the following function SAF=C+D×e ^(−K×X) where K is an exponential scaling factor, and X is the ratio of (A) the distance between the geographical feature and the viewport region (i.e., the closest edge of the viewport region), and (B) the width of the viewport skirt region, as explained above with reference to FIG. 13. In the above equation, C and D are values that are selected so that SAF equals its minimum value, MinScore, when X is equal to 1 (i.e., when the geographical feature is in the outermost portion of the skirt region, and is equal to its maximum value, 1, when X is equal to zero (i.e., when the geographical feature intersects or is adjacent the line or boundary between the viewport region and the viewport skirt region). Solving for C and D in accordance with the constraints stated above, the equation for SAF becomes:

${SAF} = {\frac{{MinScore} - {\mathbb{e}}^{- K}}{1 - {\mathbb{e}}^{- K}} + {\frac{\left( {1 - {MinScore}} \right) \times {\mathbb{e}}^{{- K} \times X}}{1 - {\mathbb{e}}^{- K}}.}}$ When K=3, e^(−K) is approximately equal to 0.5, and 1−e^(−K) is approximately equal to 0.95. When MinScore=0.2 and K=3, SAF is approximately equal to 0.158+0.842*e^(−3X) for geographic features that intersect the viewport skirt region (but do not intersect the viewport region). Note that SAF, according to this equation is equal to 1.0 when X=0, and is approximately equal to 0.2 when X=1. As noted above, SAF is equal to 1 for geographic features that intersect the viewport region, and is equal to MinScore (e.g., 0.2) for geographic features that intersect neither the viewport region nor the viewport skirt region. In other embodiments, MinScore is a value between 0.1 and 0.5, and K is a value between 2 and 10.

The foregoing descriptions of specific embodiments of the present invention are presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Rather, it should be appreciated that many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the invention and its practical applications, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as are suited to the particular use contemplated. 

1. A computer-implemented method for performing a location search, comprising: at a server system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the operations of: receiving, from a client system distinct from the server, a location search query for a desired geographical location; determining key words corresponding to the location search query, wherein at least a subset of the key words incorrectly describe the desired geographical location; searching for geographical locations corresponding to the key words, including searching an index of documents to identify one or more documents that correspond to the key words in the location search query, wherein each of the identified documents corresponds to a geographical feature at a geographical location and includes terms matching the key words of the location search query, and wherein the terms matching the key words of the location search query include terms that incorrectly describe the geographical feature; and providing, to the client system, a map to be displayed at the client system, the map including one or more location tags at the one or more geographical locations corresponding to the one or more identified documents.
 2. The method of claim 1, wherein the terms that incorrectly describe the geographical feature are selected from the group consisting of: misspellings of terms that describe the geographical feature; cities adjacent or proximate to a city that includes the geographical feature; landmarks adjacent or proximate to the geographical feature; and geographical locations adjacent or proximate to the geographical feature.
 3. The method of claim 1, wherein each document of the one or more identified documents has tokens corresponding to the determined key words of the search query.
 4. The method of claim 1, wherein the determining of the key words includes removing punctuation marks and non-location terms from the location search query.
 5. The method of claim 1, wherein the key words include one or more synonyms for one or more terms in the location search query.
 6. The method of claim 1, wherein the identifying of the one or more identified documents includes determining a canonical expression corresponding to the key words.
 7. The method of claim 1, wherein the one or more identified documents are in the index that includes a plurality of documents that correspond to geographic features.
 8. The method of claim 7, wherein the plurality of documents includes geographical reference coordinates corresponding to the geographic features.
 9. The method of claim 1, wherein the searching includes determining a score for each of the one or more identified documents.
 10. The method of claim 9, wherein a respective score is in accordance with a frequency of the key words in a plurality of documents, matches between one or more words in a respective document with one or more of the key words and sizes of geographic features corresponding to the key words.
 11. The method of claim 9, wherein the providing includes providing one geographical location if a best score for a corresponding document is greater than a pre-determined multiple of a next best score for a next document in a top-N ranking of the one or more documents.
 12. The method of claim 9, wherein the providing includes providing a top-N ranking of geographical locations corresponding to the one or more documents, and wherein the top-N ranking includes documents having scores within a pre-determined range.
 13. The method of claim 12, wherein each of the geographical locations in the top-N ranking includes a location identifier.
 14. The method of claim 12, wherein each of the geographical locations in the top-N ranking includes a corresponding link to a geographical map image.
 15. The method of claim 1, wherein the providing includes providing a geographical map image corresponding to the one or more geographical locations.
 16. The method of claim 15, wherein the geographical map image is centered on the one or more geographical locations and includes a region less than a pre-determined size around the one or more geographical locations.
 17. The method of claim 16, wherein the one or more geographical locations include two or more distinct geographical locations in a region having all the key words in common, and wherein the geographical map image includes tags corresponding to the two or more geographical locations.
 18. The method of claim 1, wherein the searching of an index of documents to identify the one or more identified documents is independent of an order of the key words.
 19. A search engine system, comprising: one or more central processing units to execute programs; memory; and a program, stored in the memory and executed by the one or more central processing units, the program including: instructions for receiving, from a client system distinct from the search engine system, a location search query for a desired geographical location; instructions for determining key words corresponding to the location search query, wherein at least a subset of the key words incorrectly describe the desired geographical location; instructions for searching an index of documents to identify one or more documents that correspond to the key words in the location search query, wherein each of the identified documents corresponds to a geographical feature at a geographical location and includes terms matching the key words of the location search query, and wherein the terms matching the key words of the location search query include terms that incorrectly describe the geographical feature; and instructions for providing, to a client system, a map to be displayed at the client system, the map including one or more location tags at one or more geographical locations corresponding to the one or more identified documents.
 20. The search engine system of claim 19, wherein the terms that incorrectly describe the geographical feature are selected from the group consisting of: misspellings of terms that describe the geographical feature; cities adjacent or proximate to a city that includes including the geographical feature; landmarks adjacent or proximate to the geographical feature; and geographical locations adjacent or proximate to the geographical feature.
 21. A non-transitory computer readable storage medium storing one or more programs for execution by one of more processors of a computer system, the one or more programs comprising: instructions for receiving, from a client system distinct from the computer system, a location search query for a desired geographical location; instructions for determining key words corresponding to the location search query, wherein at least a subset of the key words incorrectly describe the desired geographical location; instructions for searching an index of documents to identify one or more documents that correspond to the key words in the location search query, wherein each of the identified documents corresponds to a geographical feature at a geographical location and includes terms matching the key words of the location search query, and wherein the terms matching the key words of the location search query include terms that incorrectly describe the geographical feature; and instructions for providing, to a client system, a map to be displayed at the client system, the map including one or more location tags at one or more geographical locations corresponding to the one or more identified documents.
 22. The computer readable storage medium of claim 21, wherein the terms that incorrectly describe the geographical feature are selected from the group consisting of: misspellings of terms that describe the geographical feature; cities adjacent or proximate to a city that includes the geographical feature; landmarks adjacent or proximate to the geographical feature; and geographical locations adjacent or proximate to the geographical feature.
 23. A data structure stored in a non-transitory memory of a server, the data structure for use in performing location search queries received from a client system distinct from the server, comprising: a plurality of documents that includes information relating to geographic features, wherein a respective document in the plurality of documents corresponds to a geographical feature at a geographical location and includes geographical location information and supplemental information relating to the geographical location of the corresponding geographical feature, the geographical location information including key words corresponding to one or more geographical locations, one or more regions associated with the one or more geographical locations, synonyms for the key words, and key words that incorrectly describe the geographical feature, and wherein the supplemental information includes reference coordinates corresponding to the one or more geographical locations.
 24. The data structure of claim 23, wherein the key words that incorrectly describe the geographical feature are selected from the group consisting of: misspellings of terms that describe the geographical feature; cities adjacent or proximate to a city that includes the geographical feature; landmarks adjacent or proximate to the geographical feature; and geographical locations adjacent or proximate to the geographical feature.
 25. The data structure of claim 23, wherein the reference coordinates include latitude and longitude for the one or more geographical locations.
 26. The data structure of claim 23, wherein the reference coordinates include regions surrounding the one or more geographical locations, and wherein the regions are less than a pre-determined size.
 27. The data structure of claim 23, wherein the data structure is compatible with a hypertext markup language (HTML).
 28. The data structure of claim 23, wherein the geographical location information in the respective document is insensitive to an order of terms in a location search query. 